Optimal Dyck reachability for data-dependence and alias analysis
نویسندگان
چکیده
منابع مشابه
Dynamic Complexity of the Dyck Reachability
Dynamic complexity is concerned with updating the output of a problem when the input is slightly changed. We study the dynamic complexity of Dyck reachability problems in directed and undirected graphs, where updates may add or delete edges. We show a strong dichotomy between such problems, based on the size of the Dyck alphabet. Some of them are P-complete (under a strong notion of reduction) ...
متن کاملConditional Dependence in Longitudinal Data Analysis
Mixed models are widely used to analyze longitudinal data. In their conventional formulation as linear mixed models (LMMs) and generalized LMMs (GLMMs), a commonly indispensable assumption in settings involving longitudinal non-Gaussian data is that the longitudinal observations from subjects are conditionally independent, given subject-specific random effects. Although conventional Gaussian...
متن کاملConditional Dyck-CFL Reachability Analysis for Complete and Efficient Library Summarization
Library summarization is an effective way to accelerate the analysis of client code. However, information about the client is unknown at the library summarization, preventing complete summarization of the library. An existing approach utilizes tree-adjoining languages (TALs) to provide conditional summaries, enabling the summarization of a library under certain premises. However, the use of TAL...
متن کاملDetermination of Optimal Sampling Design for Spatial Data Analysis
Extended Abstract. Inferences for spatial data are affected substantially by the spatial configuration of the network of sites where measurements are taken. Consider the following standard data-model framework for spatial data. Suppose a continuous, spatially-varying quantity, Z, is to be observed at a predetermined number, n, of points ....[ To Countinue Click here]
متن کاملSource-tracking Unification using semi-Dyck labeled reachability
We propose a path-based framework for deriving and simplifying source-tracking information for first-order term unification in the empty theory. Such a framework is useful for diagnosing unification-based systems, including debugging of type errors in programs and the generation of success and failure proofs in logic programming. The objects of source-tracking are deductions in the logic of ter...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ACM on Programming Languages
سال: 2018
ISSN: 2475-1421
DOI: 10.1145/3158118